Multigrid convergence for second order elliptic problems with smooth complex coefficients
نویسندگان
چکیده
منابع مشابه
Multigrid convergence for second order elliptic problems with smooth complex coefficients
The finite element method when applied to a second order partial differential equation in divergence form can generate operators that are neither Hermitian nor definite when the coefficient function is complex valued. For such problems, under a uniqueness assumption, we prove the continuous dependence of the exact solution and its finite element approximations on data provided that the coeffici...
متن کاملSecond Order Multigrid Methods for Elliptic Problems with Discontinuous Coefficients on an Arbitrary Interface, I: One Dimensional Problems
In this paper we present a one dimensional second order accurate method to solve Elliptic equations with discontinuous coefficients on an arbitrary interface. Second order accuracy for the first derivative is obtained as well. The method is based on the Ghost Fluid Method, making use of ghost points on which the value is defined by suitable interface conditions. The multi-domain formulation is ...
متن کاملUniform convergence of multigrid V-cycle on adaptively refined finite element meshes for second order elliptic problems
Abstract In this paper we prove the uniform convergence of the standard multigrid V-cycle algorithm with Gauss-Seidel relaxation performed only on new nodes and their “immediate” neighbors for discrete elliptic problems on adaptively refined finite element meshes using the newest vertex bisection algorithm. The proof depends on sharp estimates on the relationship of local mesh sizes and a new s...
متن کاملConvergence of nonconforming V-cycle and F-cycle multigrid algorithms for second order elliptic boundary value problems
The convergence of V -cycle and F -cycle multigrid algorithms with a sufficiently large number of smoothing steps is established for nonconforming finite element methods for second order elliptic boundary value problems.
متن کاملConvergence of the multigrid V-cycle algorithm for second-order boundary value problems without full elliptic regularity
The multigrid V -cycle algorithm using the Richardson relaxation scheme as the smoother is studied in this paper. For second-order elliptic boundary value problems, the contraction number of the V -cycle algorithm is shown to improve uniformly with the increase of the number of smoothing steps, without assuming full elliptic regularity. As a consequence, the V -cycle convergence result of Braes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Methods in Applied Mechanics and Engineering
سال: 2008
ISSN: 0045-7825
DOI: 10.1016/j.cma.2008.05.018